Binary GCD Like Algorithms for Some Complex Quadratic Rings

نویسندگان

  • Saurabh Agarwal
  • Gudmund Skovbjerg Frandsen
چکیده

On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in Q( √ d) where d ∈ {−2,−7,−11,−19}. Thus a binary gcd like algorithm is presented for a unique factorization domain which is not Euclidean (case d = −19). Together with the earlier known binary gcd like algorithms for the ring of integers in Q( √−1) and Q(√−3), one now has binary gcd like algorithms for all complex quadratic Euclidean domains. The running time of our algorithms is O(n) in each ring. While there exists an O(n) algorithm for computing the gcd in quadratic number rings by Erich Kaltofen and Heinrich Rolletschek, it has large constants hidden under the big-oh notation and it is not practical for medium sized inputs. On the other hand our algorithms are quite fast and very simple to implement.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings

We prove lower bounds for the complexity of deciding several relations in imaginary, normEuclidean quadratic integer rings, where computations are assumed to be relative to a basis of piecewise-linear operations. In particular, we establish lower bounds for deciding coprimality in these rings, which yield lower bounds for gcd computations. In each imaginary, norm-Euclidean quadratic integer rin...

متن کامل

A New GCD Algorithm for Quadratic Number Rings with Unique Factorization

We present an algorithm to compute a greatest common divisor of two integers in a quadratic number ring that is a unique factorization domain. The algorithm uses O(n log n log log n + ∆ 1 2 + ) bit operations in a ring of discriminant ∆. This appears to be the first gcd algorithm of complexity o(n) for any fixed non-Euclidean number ring. The main idea behind the algorithm is a well known relat...

متن کامل

On Schönhage's algorithm and subquadratic integer gcd computation

We describe a new subquadratic left-to-right gcd algorithm, inspired by Schönhage’s algorithm for reduction of binary quadratic forms, and compare it to the first subquadratic gcd algorithm discovered by Knuth and Schönhage, and to the binary recursive gcd algorithm of Stehlé and Zimmermann. The new gcd algorithm runs slightly faster than earlier algorithms, and it is much simpler to implement....

متن کامل

Quadratic Form Representations via Generalized Continuants

H. J. S. Smith proved Fermat’s two-square theorem using the notion of palindromic continuants. In this paper we extend Smith’s approach to proper binary quadratic form representations in some commutative Euclidean rings, including rings of integers and rings of polynomials over fields of odd characteristic. Also, we present new deterministic algorithms for finding the corresponding proper repre...

متن کامل

Computing Greatest Common Divisors and Factorizations in Quadratic Number Fields*

In a quadratic number field Q(√ D ), D a squarefree integer, with class number 1 any algebraic integer can be decomposed uniquely into primes but for only 21 domains Euclidean algorithms are known. It was shown by Cohn [5] that for D ≤ – 19 even remainder sequences with possibly non-decreasing norms cannot determine the GCD of arbitrary inputs. We extend this result by showing that there does...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004